Approximately counting cliques
نویسنده
چکیده
We present a very simple, randomized approximation algorithm for determining the number of cliques in a random graph. Supported in part by NSF Grant CCR-9505448 and a UC Berkeley Faculty Research Grant
منابع مشابه
An exact exponential time algorithm for counting bipartite cliques
We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.2491), improving upon known exact algorithms for finding and counting bipartite cliques.
متن کاملOn Approximating the Number of $k$-cliques in Sublinear Time
We study the problem of approximating the number of k-cliques in a graph when given query access to the graph. We consider the standard query model for general graphs via (1) degree queries, (2) neighbor queries and (3) pair queries. Let n denote the number of vertices in the graph, m the number of edges, and Ck the number of k-cliques. We design an algorithm that outputs a (1 + ǫ)-approximatio...
متن کاملA Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem
Clique counts reveal important properties about the structure of massive graphs, especially social networks. The simple setting of just 3-cliques (triangles) has received much attention from the research community. For larger cliques (even, say 6-cliques) the problem quickly becomes intractable because of combinatorial explosion. Most methods used for triangle counting do not scale for large cl...
متن کاملCounting cliques and clique covers in random graphs
We study the problem of counting the number of isomorphic copies of a given template graph, say H , in the input base graph, say G. In general, this is (provably) very hard to solve efficiently. So, a lot of work has gone into designing efficient approximation schemes, especially, when H is a perfect matching. In this work, we present schemes to count k-cliques and k-clique covers. Our embeddin...
متن کاملCounting and Listing all Potential Maximal Cliques of a Graph
We show that the number of potential maximal cliques for an arbitrary graph G on n vertices is O∗(1.8135n), and that all potential maximal cliques can be listed in O∗(1.8899n) time. As a consequence of this results, treewidth and minimum fill-in can be computed in O∗(1.8899n) time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 11 شماره
صفحات -
تاریخ انتشار 1997